Open Partitions and Probability Assignments in Gödel Logic
نویسندگان
چکیده
In the elementary case of finitely many events, we generalise to Gödel (propositional infinite-valued) logic — one of the fundamental fuzzy logics in the sense of Hájek — the classical correspondence between partitions, quotient measure spaces, and push-forward measures. To achieve this end, appropriate Gödelian analogues of the Boolean notions of probability assignment and partition are needed. Concerning the former, we use a notion of probability assignment introduced in the literature by the third-named author et al. Concerning the latter, we introduce and use open partitions, whose definition is justified by independent considerations on the relational semantics of Gödel logic (or, more generally, of the finite slice of intuitionistic logic). Our main result yields a construction of finite quotient measure spaces in the Gödelian setting that closely parallels its classical counterpart.
منابع مشابه
Truth Values and Connectives in Some Non-Classical Logics
The question as to whether the propositional logic of Heyting, which was a formalization of Brouwer's intuitionistic logic, is finitely many valued or not, was open for a while (the question was asked by Hahn). Kurt Gödel (1932) introduced an infinite decreasing chain of intermediate logics, which are known nowadays as Gödel logics, for showing that the intuitionistic logic is not finitely (man...
متن کاملBest Approximation of Ruspini Partitions in Gödel Logic
A Ruspini partition is a finite family of fuzzy sets {f1, . . . , fn}, fi : [0, 1] → [0, 1], such that ∑ n i=1 fi(x) = 1 for all x ∈ [0, 1]. We analyze such partitions in the language of Gödel logic. Our main result identifies the precise degree to which the Ruspini condition is expressible in this language, and yields inter alia a constructive procedure to axiomatize a given Ruspini partition ...
متن کاملAn Analysis of Ruspini Partitions in Gödel Logic
By a Ruspini partition we mean a finite family of fuzzy sets {f1, . . . , fn}, fi : [0, 1] → [0, 1], such that ∑n i=1 fi(x) = 1 for all x ∈ [0, 1], where [0, 1] denotes the real unit interval. We analyze such partitions in the language of Gödel logic. Our first main result identifies the precise degree to which the Ruspini condition is expressible in this language, and yields inter alia a const...
متن کاملThe logical content of triangular bases of fuzzy sets in Lukasiewicz infinite-valued logic
Continuing to pursue a research direction that we already explored in connection with Gödel-Dummett logic and Ruspini partitions, we show here that Lukasiewicz logic is able to express the notion of pseudo-triangular basis of fuzzy sets, a mild weakening of the standard notion of triangular basis. En route to our main result we obtain an elementary, logic-independent characterisation of triangu...
متن کاملEuler Characteristic in Gödel and Nilpotent Minimum Logics
Some decades ago, V. Klee and G.-C.Rota introduced a lattice-theoretic analogue of the Euler characteristic, the celebrated topological invariant of polyhedra. In [1], using the Klee-Rota definition, we introduce the Euler characteristic of a formula in Gödel logic, the extension of intuitionistic logic via the prelinearity axiom. We then prove that the Euler characteristic of a formula over n ...
متن کامل